Proof nets and semi-⋆-autonomous categories
نویسندگان
چکیده
In this paper it is proved that Girard's proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.
منابع مشابه
Proof nets and free semi-⋆-autonomous categories
In this paper it is proved that Girard’s proof nets for multiplicative linear logic characterise free semi-⋆-autonomous-categories.
متن کاملProfunctor Semantics for Linear Logic
Linear logic is a sort of “resource-aware” logic underlying intuitionistic logic. Investigations into the proof theory of this logic typically revolve around proof nets, certain two-dimensional graphical representations of proofs. Where sequent calculus deductions enforce arbitrary distinctions between proofs and complicate these investigations, proof nets represent sequent calculus deductions ...
متن کاملFrom Proof nets to the Free *-Autonomous Categories
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set of axiom links but a tree in which the axiom links are subtrees. These trees will be identified according to an equivalence relation based on a simple form ...
متن کاملCoherence of Proof-Net Categories
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly’s and Mac Lane’s coherence theorem for symmetric monoidal closed categories. A coherence theorem with respect to these graphs is proved for proof-net categories. Such a coherence ...
متن کاملMALL proof nets identify proofs modulo rule commutation
The proof nets for MALL (Multiplicative Additive Linear Logic [2], without units) introduced in [4, 5] solved numerous issues with monomial proof nets [3], for example: • There is a simple (deterministic) translation function from cut-free proofs to proof nets. • Cut elimination is simply defined and strongly normalising. • Proof nets form a semi (i.e., unit-free) star-autonomous category with ...
متن کامل